A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.Peer reviewe

Local algorithms : Self-stabilization on speed

Non peer reviewe

Distributed approximation algorithms in unit disc graphs

Abstract. We will give distributed approximation schemes for the maximum matching problem and the minimum connected dominating set problem in unit-disk graphs. The algorithms are deterministic, run in a poly-logarithmic number of rounds in the message passing model and the approximation error can be made O(1 / log k |G|) where |G | is the order of the graph and k is a positive integer.

maximum

Distributed algorithm for approximating th